The Polya algorithm in sequence spaces

Performance of the Viterbi Algorithm on a Polya Channel

The Performance of the Viterbi algorithm with a new Polya contagion noise process is analyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya channel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a GaussPolya noise model is introduced this way in order to perf...

A New Class of Banach Sequence Spaces

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Brain-specific polyA- transcripts are detected in polyA+ RNA: do complex polyA- brain RNAs really exist?

Transcripts encoded by 2 different rat genomic clones, rg13 and rg100, appear to be typical brain-specific polyA- RNAs, as defined by previous criteria (rare, polysomal, and postnatally expressed from single-copy genes). However, we have found by using a sensitive nuclease protection assay that low levels of these transcripts (10% and 3%, respectively) are detected in polyA+ RNA. To determine i...

Weighing the "heaviest" Polya urn

For the classical Polya urn model parametrized by exponent γ, the limit distributions of the fraction of balls in each bin are simple and well known when γ < 1 (“egalitarian”) and when γ > 1 (“winner takes all”). In this note, we partially fill in the gap for γ = 1, the critical point, by providing explicit analytical expressions for all the moments of the limit distribution of the fraction of ...